Optimal HMM

نویسنده

  • John Moore
چکیده

In this paper conditional hidden Markov model (HMM) lters and conditional Kalman lters (KF) are coupled together to improve demodulation of di erential encoded signals in noisy fading channels. We present an indicator matrix representation for di erential encoded signals and the optimal HMM lter for demodulation. The lter requires O(N) calculations per time iteration, where N is the number of message symbols. Decision feedback equalisation is investigated via coupling the optimal HMM lter for estimating the message, conditioned on estimates of the channel parameters, and a KF for estimating the channel states, conditioned on soft infomation message estimates. Here the soft message estimates are conditional mean estimates. The conditional KF is an adaptive channel estimation scheme based on modelling the phase and amplitude variations as a stochastic linear system. The key to our coupled HMM-KF lter approach is that the HMM lter provides immediate soft information message estimates and our Kalman Filter exploits the idempotent nature of Markov chains. The particular di erential encoding scheme examined in this paper is di erential phase shift keying (DPSK). However, the techniques developed can be extended to other forms of di erential modulation. The channel model we use allows for multiplicative channel distortions and additive white Gaussian noise. Simulation studies are also presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speech enhancement based on hidden Markov model using sparse code shrinkage

This paper presents a new hidden Markov model-based (HMM-based) speech enhancement framework based on the independent component analysis (ICA). We propose analytical procedures for training clean speech and noise models by the Baum re-estimation algorithm and present a Maximum a posterior (MAP) estimator based on Laplace-Gaussian (for clean speech and noise respectively) combination in the HMM ...

متن کامل

Clustering sequence data using hidden Markov model representation

This paper proposed a clustering methodology for sequence data using hidden Markov model(HMM) representation. The proposed methodology improves upon existing HMM based clustering methods in two ways: (i) it enables HMMs to dynamically change its model structure to obtain a better t model for data during clustering process, and (ii) it provides objective criterion function to select the optimal ...

متن کامل

Comparison of continuous-density and semi-continuous HMM in isolated words recognition systems

Several types of Semi-Continuous HMM (SC-HMM) have been compared with the Continuous Density HMM (CD-HMM) in the context of Speaker Independent Isolated Words Recognition (SI-IWR). It is demonstrated that for the ten-digit vocabulary (TIDIGITS), the SC-HMM outperforms the CD-HMM when memory constraints are imposed on the system. SC-HMMs demonstrate recognition rate of about 95% with a total of ...

متن کامل

A New Fast and Efficient HMM-Based Face Recognition System Using a 7-State HMM Along With SVD Coefficients

In this paper, a new Hidden Markov Model (HMM)-based face recognition system is proposed. As a novel point despite of five-state HMM used in pervious researches, we used 7-state HMM to cover more details. Indeed we add two new face regions, eyebrows and chin, to the model. As another novel point, we used a small number of quantized Singular Values Decomposition (SVD) coefficients as feature...

متن کامل

Finding Behavior Patterns from Temporal Data using Hidden Markov Model based Unsupervised Classi cation

This paper describes a clustering methodology for temporal data using hidden Markov model(HMM) representation. The proposed method improves upon existing HMM based clustering methods in two ways: (i) it enables HMMs to dynamically change its model structure to obtain a better t model for data during clustering process, and (ii) it provides objective criterion function to automatically select th...

متن کامل

Phoneme Recognition using Hidden Markov Models: Evaluation with signal parameterization techniques

HMM applications show that they are an effective and powerful tool for modelling especially stochastic signals. For this reason, we use HMM for Timit phoneme recognition. The main goal is to study the performance of an HMM phoneme recognizer to fix on an optimal signal parameters. So, we apply different techniques of speech parameterization such as MFCC, LPCC and PLP. Then, we compare the recog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998